Perfect Matrix Methods
نویسندگان
چکیده
Let e¿ = (S„)jl i, A = (ei)4" j and let A be an infinite matrix which maps E into E where E is an FK-spa.ce with Schauder basis A. Necessary and sufficient conditions in terms of the matrix A are obtained for E to be dense in the summability space Ea = {3c|j43cG£} and conditions are obtained to guarantee that Ea has Schauder basis A. Finally it is shown that if weak and strong sequential convergence coincide in E then in Ea the series X)***^ converges to x strongly if and only if it converges to x weakly.
منابع مشابه
Three-Phase to Single-Phase Matrix Converters: New Topology Based on New Control Method
In this paper, a new topology is proposed for three-phase to single-phase matrix converters, where more voltage levels are produced in the output in comparison with the conventional topologies. In addition, a new control method based on minimum error between the generated and the desired output voltages is proposed for three-phase to single-phase matrix converters. In the proposed control metho...
متن کاملAltan derivatives of a graph
Altan derivatives of polycyclic conjugated hydrocarbons were recently introduced and studied in theoretical organic chemistry. We now provide a generalization of the altan concept, applicable to any graph. Several earlier noticed topological properties of altan derivatives of polycyclic conjugated hydrocarbons are shown to be the properties of all altan derivatives of all graphs. Among these ar...
متن کاملA Perfect Explicit Model following Control Solution to Imperfect Model following Control Problems
For cases in which perfect model following is not possible for a particular desired model, a class of candidate models is defined that can be followed perfectly by the given plant. A candidate model that most closely matches the dynamics of the desired model is then determined through constrained parameter optimization. The result is perfect model following of a model that has an eigenstructure...
متن کاملDesign of perfect reconstruction FIR multifilters
The design of perfect reconstruction FIR multi lters is discussed in this paper. Schur algorithm is applied to factorize the polyphase matrix of multi lters into lattice blocks. The multi lters are characterized by the chain parameters in each lattice block. The complete parameterization of paraunitary multi lters and a class of biorthogonal multilters are derived. The parameterizations are min...
متن کاملOn the Existence of Nonsymmetric Matrices with Perfect Elimination Orderings
Permuting the rows and columns of a sparse matrix can dramatically reduce the memory requirements of a subsequently computed LU factorization. A perfect elimination matrix is one whose rows and columns can be permuted so that its LU factors require no additional space on top of that required by the original matrix. An implemention of an O(n) algorithm, presented in [6], for determining whether ...
متن کاملPerfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable
Haplotyping via perfect phylogeny is a method for retrieving haplotypes from genotypes. Fast algorithms are known for computing perfect phylogenies from complete and error-free input instances—these instances can be organized as a genotype matrix whose rows are the genotypes and whose columns are the single nucleotide polymorphisms under consideration. Unfortunately, in the more realistic setti...
متن کامل